An Improved Toeplitz Measurement Matrix for Compressive Sensing
نویسندگان
چکیده
منابع مشابه
An Optimized Toeplitz Measurement Matrix based on ANN for Compressive Sensing ⋆
Compressive sensing takes advantage of the signals in some domain, allowing the entire signal to efficiently acquired and reconstructed from relatively few measurements. Toeplitz matrix has more advantages in the amount of data and computation over Gaussian random matrix, but its far from Gaussian matrix in the performance of signal reconstruction. In this paper, Toeplitz matrix is employed and...
متن کاملMeasurement Matrix Design for Compressive Sensing Based MIMO Radar
In colocated multiple-input multiple-output (MIMO) radar using compressive sensing (CS), a receive node compresses its received signal via a linear transformation, referred to as measurement matrix. The samples are subsequently forwarded to a fusion center, where an l1-optimization problem is formulated and solved for target information. CS-based MIMO radar exploits the target sparsity in the a...
متن کاملAnti-measurement Matrix Uncertainty Sparse Signal Recovery for Compressive Sensing
Compressive sensing (CS) is a technique for estimating a sparse signal from the random measurements and the measurement matrix. Traditional sparse signal recovery methods have seriously degeneration with the measurement matrix uncertainty (MMU). Here the MMU is modeled as a bounded additive error. An anti-uncertainty constraint in the form of a mixed 2 and 1 norm is deduced from the sparse ...
متن کاملQuantized Compressive Sensing Measurement Based on Improved Subspace Pursuit Algorithm
Recent research results in compressive sensing have shown that sparse signals can be recovered from a small number of random measurements. Whether quantized compressive measurements can provide an efficient representation of sparse signals in information-theoretic needs discuss. In this paper, the distortion rate functions are used as a tool to research the quantizing compressive sensing measur...
متن کاملAn improved Toeplitz algorithm for polynomial matrix null-space computation
In this paper we present an improved algorithm to compute the minimal null-space basis of polynomial matrices, a problem which has many applications in control and systems theory. This algorithm takes advantage of the block Toeplitz structure of the Sylvester matrix associated with the polynomial matrix. The analysis of algorithmic complexity and numerical stability shows that the algorithm is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2014
ISSN: 1550-1477,1550-1477
DOI: 10.1155/2014/846757